Semi-G-Preinvexity and Optimality in Mathematical Programming
نویسندگان
چکیده
منابع مشابه
Semistrict G-Preinvexity and Optimality in Nonlinear Programming
and Applied Analysis 3 Proof. Let x, y ∈ K. From the assumption of f(y+η(x, y)) ≤ f(x), when λ = 0, 1, we can know that f (y + λη (x, y)) ≤ G −1 (λG (f (x)) + (1 − λ)G (f (y))) . (9) Then, there are two cases to be considered. (i) Iff(x) ̸ = f(y), then by the semistrictG-preinvexity of f, we have the following:
متن کاملPreinvexity and Semi-Continuity of Fuzzy Mappings
In this paper, the relationships between semicontinuity and preinvexity of fuzzy mappings are investigated. The concepts of intermediate-point preinvex fuzzy mappings and weakly preinvex fuzzy mappings are first introduced, and the authors establish a characterization for a weakly preinvex fuzzy mapping in terms of its epigraph. In this context, a characterization of a preinvex fuzzy mapping in...
متن کاملA necessary second-order optimality condition in nonsmooth mathematical programming
Generalized second–order directional derivatives for nonsmooth real–valued functions are studied and their connections with second–order variational sets are investigated. A necessary second–order optimality condition for problems with inequality constraints is obtained.
متن کاملINVITED REVIEW Semi-infinite programming, duality, discretization and optimality conditionsy
Here is a (possibly infinite) index set, R 1⁄4 R [ fþ1g [ f 1g denotes the extended real line, f : R ! R and g : R !R. The above optimization problem is performed in the finite-dimensional space R and, if the index set is infinite, is a subject to an infinite number of constraints, therefore it is referred to as a SIP problem. There are numerous applications which lead to SIP problems. We can r...
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/396142